package com.algorithm.ch1.cjm.array;

/**
 * 给定一个数组，将数组中的元素向右移动 k 个位置，其中 k 是非负数。
 *
 * 输入: [1,2,3,4,5,6,7] 和 k = 3
 * 输出: [5,6,7,1,2,3,4]
 * 解释:
 *  向右旋转 1 步: [7,1,2,3,4,5,6]
 *  向右旋转 2 步: [6,7,1,2,3,4,5]
 *  向右旋转 3 步: [5,6,7,1,2,3,4]
 */
public class Rotate{

    public static void main(String[] args) {

//        int[] nums = new int[]{8,2,0,4,1,4,2,1,0,6,6,2,5,6,6,2,7,9,4,1,3,9,6,5,4,8,7,8,9,2,5,5,8,3,0,5,2,5,3,9
//                ,8,5,8,8,6,3,0,2,8,1,8,4,6,4,1,6,4,3,7,9,3,0,3,9,3,3,2,1,3,2,8,7,7,7,2,0,3,1,2,1,7,7,2,8,4,0,4,
//                3,1,9,1,5,9,8,5,6,4,2,8,0,9,6,5,7,2,6,3,1,2,1,0,6,9,7,5,3,9,8,2,6,1,8,6,6,4,4,7,3,3,5,3,2,2,9,2,
//                8,1,4,8,1,5,4,9,4,4,5,1,5,8,7,6,8,5,8,4,4,1,5,3,9,4,8,6,8,6,3,4,8,7,0,6,8,1,8,9,8,1,9,1,4,9,2,8,2,6,7,1,9,1,0,
//                4,5,8,9,0,8,0,7,7,4,9,6,3,1,6,1,9,9,6,8,1,0,0,4,1,3,4,8,8,9,6,9,0,1,4,4,6,9,4,8,4,3,7,7,4,5,8,1,8,7,7,3,4,3,0,3,2,5,1,7,8,1,0,8,5,6,3,7,1,6,0,9,8,6,7,8,5,7,5,6,6,9,2,0,4,6,8,5,9,4,6,3,8,8,3,1,2,2,0,4,4,0,8,8,1,9,9,1,7,9,1,7,0,5,9,6,5,1,0,4,2,6,0,3,3,9,1,4,9,0,7,0,8,0,4,1,9,5,1,0,3,6,0,3,1,2,8,4,6,7,6,1,2,6,5,5,5,3,9,8,0,0,7,3,5,4,1,1,5,3,8,4,0,0,4,6,8,3,9,8,5,7,7,7,3,9,9,2,4,6,2,0,9,6,3,0,7,4,2,3,0,2,5,5,8,1,7,5,8,4,7,3,8,2,5,3,8,8,6,3,5,7,7,8,1,3,7,6,9,5,1,8,4,0,6,6,4,9,3,2,2,9,2,6,2,9,9,7,2,9,6,7,8,8,1,6,0,9,0,4,8,9,7,6,9,2,7,5,3,9,8,7,9,9,8,4,4,6,9,5,5,0,6,4,9,2,3,7,6,2,7,9,1,2,1,8,9,6,5,4,5,7,5,1,7,0,9,1,9,9,9,9,2,1,9,6,0,7,1,7,6,7,7,5,3,8,9,2,3,6,4,2,7,0,8,0,6,7,5,2,9,6,5,3,1,5,2,0,9,3,6,8,0,2,6,8,4,6,1,1,1,5,0,5,3,2,9,1,3,8,0,5,9,2,0,0,5,8,4,5,2,8,7,2,4,3,0,4,5,2,8,5,8,3,6,1,2,9,8,3,5,5,3,3,1,5,0,7,5,2,1,1,4,9,5,2,3,8,8,1,6,6,9,1,0,5,2,7,8,0,8,5,7,6,5,9,8,5,1,1,1,1,5,2,2,6,9,3,2,6,6,1,7,4,2,2,9,9,0,7,1,5,1,8,7,5,0,7,5,2,1,3,3,4,7,3,8,8,6,1,6,6,8,4,4,3,2,1,6,1,0,2,1,2,4,5,8,8,0,5,9,2,7,3,5,0,9,5,5,7,8,8,8,2,5,8,6,6,9,4,5,5,0,1,9,3,9,5,1,5,3,2,2,6,7,3,3,6,2,9,0,8,6,2,6,9,1,2,0,2};
//        rotate(nums, 11939);

        int[] nums = {1,2,3,4,5,6,7};
        rotate(nums, 3);

    }

    public static void rotate(int[] nums, int k) {

        int length = nums.length;

        k = k%length;

        if(k == 0){
            return;
        }

        int[] res = new int[length];

        for(int i = 0; i < length - k; i ++){

            res[i] = nums[length -i - k];
        }

        nums = res;

        for(int i = 0 ; i < nums.length ;i ++){
            System.out.print(nums[i] + ",");
        }

    }

}
